New Underestimator for Multivariate Global Optimization with Box Constraints
نویسندگان
چکیده
The paper is concerned with the multivariate global optimization with box constraints. A new underestimator is investigated for twice continuously differentiable function on a box which is an extension of the approach developed in [5] for univariate global optimization. AMS Subject Classification: 65K05, 90C30, 90C34
منابع مشابه
Multi-funnel optimization using Gaussian underestimation
In several applications, underestimation of functions has proven to be a helpful tool for global optimization. In protein-ligand docking problems as well as in protein structure prediction, single convex quadratic underestimators have been used to approximate the location of the global minimum point. While this approach has been successful for basin-shaped functions, it is not suitable for ener...
متن کاملMonomial-wise optimal separable underestimators for mixed-integer polynomial optimization
In this paper we introduce a new method for solving box-constrained mixed-integer polynomial problems to global optimality. The approach, a specialized branch-and-bound algorithm, is based on the computation of lower bounds provided by the minimization of separable underestimators of the polynomial objective function. The underestimators are the novelty of the approach because the standard appr...
متن کاملGlobal optimization in the 21st century: Advances and challenges
This paper presents an overview of the research progress in global optimization during the last 5 years (1998–2003), and a brief account of our recent research contributions. The review part covers the areas of (a) twice continuously differentiable nonlinear optimization, (b) mixedinteger nonlinear optimization, (c) optimization with differential-algebraic models, (d) optimization with grey-box...
متن کاملNonconvex Piecewise-Quadratic Underestimation for Global Minimization
Motivated by the fact that important real-life problems, such as the protein docking problem, can be accurately modeled by minimizing a nonconvex piecewise-quadratic function, a nonconvex underestimator is constructed as the minimum of a finite number of strictly convex quadratic functions. The nonconvex underestimator is generated by minimizing a linear function on a reverse convex region and ...
متن کاملCGU: An Algorithm for Molecular Structure Prediction
A global optimization method is presented for predicting the minimum energy structure of small protein-like molecules. This method begins by collecting a large number of molecular conformations, each obtained by finding a local minimum of a potential energy function from a random starting point. The information from these conformers is then used to form a convex quadratic global underestimating...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013